BIAS REDUCTION USING MAHALANOBIS METRIC MATCHING

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Validation of Matching Hypotheses Using Mahalanobis Distance

The validation of matching hypotheses using Mahalanobis distance is extensively utilized in robotic applications, and in general data-association techniques. The Ma-halanobis distance, deened by t h e i n n o vation and its covariance, is compared with a threshold deened by the chi-square distribution to validate a matching hypothesiss the validation test is a time-consuming operation. This pap...

متن کامل

Learning a Mahalanobis Metric from Equivalence Constraints

Many learning algorithms use a metric defined over the input space as a principal tool, and their performance critically depends on the quality of this metric. We address the problem of learning metrics using side-information in the form of equivalence constraints. Unlike labels, we demonstrate that this type of side-information can sometimes be automatically obtained without the need of human ...

متن کامل

A Scalable Algorithm for Learning a Mahalanobis Distance Metric

In this work, we propose a scalable and fast algorithm to learn a Mahalanobis distance metric. The key issue in this task is to learn an optimal Mahalanobis matrix in this distance metric. It has been shown in the statistical learning theory [?] that increasing the margin between different classes helps to reduce the generalization error. Hence, our algorithm formulates the Mahalanobis matrix a...

متن کامل

Learning a Mahalanobis distance metric for data clustering and classification

Article history: Received 7 October 2007 Received in revised form 27 February 2008 Accepted 16 May 2008

متن کامل

Learning Mahalanobis Distance Metric: Considering Instance Disturbance Helps

Mahalanobis distance metric takes feature weights and correlation into account in the distance computation, which can improve the performance of many similarity/dissimilarity based methods, such as kNN. Most existing distance metric learning methods obtain metric based on the raw features and side information but neglect the reliability of them. Noises or disturbances on instances will make cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ETS Research Bulletin Series

سال: 1978

ISSN: 0424-6144

DOI: 10.1002/j.2333-8504.1978.tb01164.x